Distance enumerators for permutation groups

نویسندگان

  • Robert F. Bailey
  • Jonathan P. Dixon
چکیده

We consider the distance enumerator ∆G(x) of a finite permutation group G, which is the polynomial ∑ g∈G xn−π(g), where n is the degree of G and π(g) the number of fixed points of g ∈ G. In particular, we introduce a bivariate polynomial which is a special case of the cycle index of G, and from which ∆G(x) can be obtained, and then use this new polynomial to prove some identities relating the distance enumerators of groups G and H with those of their direct and wreath products. In the case of the direct product, this answers a question of Blake, Cohen and Deza from 1979. We also use the identity for the wreath product to find an explicit combinatorial expression for the distance enumerators of the generalised hyperoctahedral groups Cm oSn.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum Weight Enumerators

In a recent paper, Shor and Laflamme define two “weight enumerators” for quantum error-correcting codes, connected by a MacWilliams transform, and use them to give a linear-programming bound for quantum codes. We introduce two new enumerators which, while much less powerful at producing bounds, are useful tools nonetheless. The new enumerators are connected by a much simpler duality transform, ...

متن کامل

On the Hamming Weight Enumerators of Self - DualCodes

In this note, we investigate the Hamming weight enumerators of self-dual codes over F q and Zk. Using invariant theory, a basis for the space of invariants to which the Hamming weight enumerators belong for self-dual codes over F q and Zk is determined. 2

متن کامل

Weight Enumerators of Self - Orthogonal Codes over Gf ( 3 )

The Hamming and complete weight enumerators of maximally self-orthogonal codes over GF(3) of lengths 12m 1, 12m and 12rn + are characterized. The results for length 12rn + are believed to be new, while those for length 12m-and 12m have been considerably simplified.

متن کامل

QUASI-PERMUTATION REPRESENTATIONS OF METACYCLIC 2-GROUPS

By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus, every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fa...

متن کامل

Cumulative Distance Enumerators of Random Codes and their Thresholds

Cumulative weight enumerators of random linear codes are introduced, their asymptotic properties are studied, and very sharp thresholds are exhibited; as a consequence, it is shown that the asymptotic GilbertVarshamov bound is a very sharp threshold point for the density of the linear codes whose relative distance is greater than a given positive number. For arbitrary random codes, similar sett...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006